Faster Support Vector Machines

نویسندگان

چکیده

The time complexity of support vector machines (SVMs) prohibits training on huge datasets with millions data points. Recently, multilevel approaches to train SVMs have been developed allow for time-efficient datasets. While regular perform the entire in one—time-consuming—optimization step, first build a hierarchy problems decreasing size that resemble original problem and then an SVM model each level, benefiting from solved models previous levels. We present faster machine uses label propagation algorithm construct hierarchy. Extensive experiments indicate our approach is up orders magnitude than fastest while having comparable classification quality. For example, already one sequential solvers average factor 15 parallel ThunderSVM algorithm, similar 1

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STAGE-DISCHARGE MODELING USING SUPPORT VECTOR MACHINES

Establishment of rating curves are often required by the hydrologists for flow estimates in the streams, rivers etc. Measurement of discharge in a river is a time-consuming, expensive, and difficult process and the conventional approach of regression analysis of stage-discharge relation does not provide encouraging results especially during the floods. P

متن کامل

Binarized Support Vector Machines

The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have become more popular among practitioners than SVM thanks to their interpretability, which is an important issue in Data Mining. In this work, we propose an SVM-based method that automatically detects the most important pre...

متن کامل

Ellipsoidal Support Vector Machines

This paper proposes the ellipsoidal SVM (e-SVM) that uses an ellipsoid center, in the version space, to approximate the Bayes point. Since SVM approximates it by a sphere center, e-SVM provides an extension to SVM for better approximation of the Bayes point. Although the idea has been mentioned before (Ruján (1997)), no work has been done for formulating and kernelizing the method. Starting fro...

متن کامل

-norm Support Vector Machines

The standard -norm SVM is known for its good performance in twoclass classification. In this paper, we consider the -norm SVM. We argue that the -norm SVM may have some advantage over the standard -norm SVM, especially when there are redundant noise features. We also propose an efficient algorithm that computes the whole solution path of the -norm SVM, hence facilitates adaptive selection of th...

متن کامل

Sequential Support Vector Machines

In this paper, we derive an algorithm to train support vector machines sequentially. The algorithm makes use of the Kalman lter and is optimal in a minimum variance framework. It extends the support vector machine paradigm to applications involving real-time and non-stationary signal processing. It also provides a computationally eecient alternative to the problem of quadratic optimisation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Journal of Experimental Algorithms

سال: 2021

ISSN: ['1084-6654']

DOI: https://doi.org/10.1145/3484730